Integration of SMT-LIB Support into Maple
نویسنده
چکیده
The SC project arose out of the recognition that the Symbolic Computation and Satisfiability Checking communities mutually benefit from the sharing of results and techniques. An SMT solver can profit from the inclusion of computer algebra techniques in its theory solver, while a computer algebra system can profit from dispatching SAT or SMT queries which arise as sub-problems during computation to a dedicated external solver; many existing implementations of both of these may be found. Here we describe on-going work in the second category: an API in Maple for dispatching computations to, and processing results from, an SMT solver supporting the SMT-LIB 2 format.
منابع مشابه
OpenMath and SMT-LIB
OpenMath and SMT-LIB are languages with very different origins, but both"represent mathematics". We describe SMT-LIB for the OpenMath community and consider adaptations for both languages to support the growing SC-Square initiative.
متن کاملProgram Verification as Satisfiability Modulo Theories
A key driver of SMT over the past decade has been an interchange format, SMT-LIB, and a growing set of benchmarks sharing this common format. SMT-LIB captures very well an interface that is suitable for many tasks that reduce to solving first-order formulas modulo theories. Here we propose to extend these benefits into the domain of symbolic software model checking. We make a case that SMT-LIB ...
متن کاملargo-lib: A Generic Platform for Decision Procedures
argo-lib is a C++ library that provides support for using decision procedures and for schemes for combining and augmenting decision procedures. This platform follows the smt-lib initiative which aims at establishing a library of benchmarks for satisfiability modulo theories. The platform can be easily integrated into other systems. It also enables comparison and unifying of different approaches...
متن کاملExtending SMT-LIB v2 with λ-Terms and Polymorphism
This paper describes two syntactic extensions to Smt-Lib scripts: lambda-expressions and polymorphism. After extending the syntax to allow these expressions, we show how to update the typing rules of the Smt-Lib to check the validity of these new terms and commands. Since most Smt-solvers only deal with many-sorted first-order formulas, we detail a monomorphization mechanism to allow to use pol...
متن کاملSMTtoTPTP - A Converter for Theorem Proving Formats
SMTtoTPTP is a converter from proof problems written in the SMT-LIB format into the TPTP TFF format. The SMT-LIB format supports polymorphic sorts and frequently used theories like those of uninterpreted function symbols, arrays, and certain forms of arithmetics. The TPTP TFF format is an extension of the TPTP format widely used by automated theorem provers, adding a sort system and arithmetic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017